Broadcast encryption based non-interactive key distribution in MANETs
نویسندگان
چکیده
منابع مشابه
Tree based symmetric key broadcast encryption
The most influential broadcast encryption (BE) scheme till date was introduced in 2001 by Naor, Naor and Lotspiech (NNL) and is based on binary trees. This paper generalizes the ideas of NNL to obtain BE schemes based on k-ary trees for any k ≥ 2. The treatment is uniform across all k and essentially provides a single scheme which is parameterized by the arity of the underlying tree. We perform...
متن کاملA key-policy attribute-based broadcast encryption
According to the broadcast encryption scheme with wide applications in the real world without considering its security and efficiency in the model simultaneously an “unbounded”, Key-Policy Attribute-Based Broadcast Encryption scheme(KP-ABBE) was proposed by combining with waters dual system encryption, attribute-based encryption and broadcast encryption system. Based on the standard model, the ...
متن کاملKey Generation of Attribute Based Broadcast Encryption
Broadcast Encryption (BE) scheme is allows the sender to securely distribute a data to a dynamically changing set of users over a unsecure channel. Attribute based Broadcast Encryption (ABBE) is a excellent approach for broadcasting. Existing BE classical BE approach required an explicitly specified decrypter list. In ABBE differentiate groups of users by their attribute. In ABBE encrypter enfo...
متن کاملGeneralized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution
In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish a common key. This scheme made use of a key predistribution scheme due to Blom. In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes. ...
متن کاملAdaptively-Secure, Non-interactive Public-Key Encryption
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of alreadycorrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2014
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2013.06.009